**Movable cellular automaton** — method Movable cellular automaton actively changed self neighbors by means switching neighbors state from linked to unlinked and vice versa (modeling of contact interaction) Method type Continuous/Discrete Discrete … Wikipedia

**Cellular automaton** — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states … Wikipedia

**Block cellular automaton** — The Margolus neighborhood for a two dimensional block cellular automaton. The partition of the cells alternates between the set of 2 × 2 blocks indicated by the solid blue lines, and the set of blocks indicated by the dashed red lines. A block… … Wikipedia

**Life-like cellular automaton** — A cellular automaton (CA) is Life like (in the sense of being similar to Conway s Game of Life) if it meets the following criteria: The array of cells of the automaton has two dimensions. Each cell of the automaton has two states (conventionally… … Wikipedia

**Quantum dot cellular automaton** — Quantum Dot Cellular Automata (sometimes referred to simply as quantum cellular automata, or QCA) Any device designed to represent data and perform computation, regardless of the physics principles it exploits and materials used to build it, must … Wikipedia

**Probabilistic automaton** — In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non deterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition… … Wikipedia

**Garden of Eden (cellular automaton)** — An orphan pattern in Conway s Game of Life, discovered by R. Banks in 1971.[1] … Wikipedia

**Continuous automaton** — A continuous automaton can be described as a cellular automaton extended so the valid states a cell can take are not just discrete (for example, the states consist of integers between 0 and 3), but continuous, for example, the real number range… … Wikipedia

**Hybrid automaton** — A hybrid automaton (plural hybrid automata) is a mathematical model for precisely describing systems where computational processes interact with physical processes. Its behavior consists of discrete state transitions and continuous… … Wikipedia

**Aperiodic finite state automaton** — An aperiodic finite state automaton is a finite state automaton whose transition monoid is aperiodic.PropertiesA regular language is star free if and only if it is accepted by an automaton with a finite and aperiodic transition monoid. This… … Wikipedia